Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

نویسندگان

چکیده

In the last decade, decision diagrams (DDs) have been basis for a large array of novel approaches modeling and solving optimization problems. Many techniques now use DDs as key tool to achieve state-of-the-art performance within other paradigms, such integer programming constraint programming. This paper provides survey in discrete optimization, particularly focusing on recent developments. We classify these works into two groups based type diagram (i.e., exact or approximate) present thorough description their use. discuss main advantages DDs, point out major challenges, provide directions future work.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Optimization with Decision Diagrams

We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, while restricted BDDs supply a primal heuristic. Each problem is given a dynamic programming model that allows one to...

متن کامل

Recent Advances in Global Optimization for Combinatorial Discrete Problems

The optimization of discrete problems is largely encountered in engineering and information domains. Solving these problems with continuous-variables approach then convert the continuous variables to discrete ones does not guarantee the optimal global solution. Evolutionary Algorithms (EAs) have been applied successfully in combinatorial discrete optimization. Here, the mathematical basics of r...

متن کامل

Ternary Decision Diagrams: Survey

This paper surveys seven types of TDDs: General TDD, SOP TDD, ESOP TDD, AND TDD, prime TDD, EXOR TDD, and Kleene TDD. We give new de nitions for SOP TDDs and ESOP TDDs and introduce unifying terminology. After showing some theorems on complexities, we compare the sizes of these TDDs using benchmark functions. Finally, we review important works on TDDs.

متن کامل

Genetic Algorithm for Ordered Decision Diagrams Optimization

In this paper we present an approach for the optimization of ordered Binary Decision Diagrams (OBDDs), based on Genetic Algorithms. In this method we consider completely specified Boolen Functions (BFs). The method uses specific reordering heuristics [3] and combines them with principles of genetic algorithms in order to determine a good variable ordering. Only small populations are considered ...

متن کامل

Rollout Algorithms for Discrete Optimization: A Survey

This chapter discusses rollout algorithms, a sequential approach to optimization problems, whereby the optimization variables are optimized one after the other. A rollout algorithm starts from some given heuristic and constructs another heuristic with better performance than the original. The method is particularly simple to implement, and is often surprisingly e↵ective. This chapter explains t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: INFORMS journal on computing

سال: 2022

ISSN: ['1091-9856', '1526-5528']

DOI: https://doi.org/10.1287/ijoc.2022.1170